Capacity Scaling Laws in Asynchronous Relay Networks
نویسندگان
چکیده
This paper examines capacity scaling in asynchronous relay networks, where L single-antenna source-destination terminal pairs communicate concurrently through a common set of K single-antenna relay terminals using one-hop relaying. In the perfectly synchronized case, assuming perfect channel state information (CSI) at the relays, the network capacity is known [1] to scale (asymptotically in K for fixed L) as C = L2 log(K) + O(1). In the absence of CSI at the relay terminals, it was shown in [1] that a simple amplify-and-forward architecture, asymptotically in K for fixed L, turns the network into a point-to-point multiple-input multipleoutput (MIMO) link with high-SNR capacity C = L2 log(SNR) + O(1). In this paper, we demonstrate that lack of synchronization in the network, under quite general conditions on the synchronization error characteristics, leaves the capacity scaling laws for both scenarios fundamentally unchanged. However, synchronization errors do result in a reduction of the spatial multiplexing gain (pre-log in the capacity expression) and the effective signal-to-noise ratio at the destination terminals. Quantitative results for these losses, as a function of the synchronization error characteristics, are provided.
منابع مشابه
CAPACITY BOUNDS AND SCALING LAWS OF WIRELESS RELAY NETWORKS by
Driven by the fast-growing demand on wireless applications, cooperative relaying has recently received much attention. In this dissertation, cooperative relaying in MIMO systems and sensor networks is studied extensively, with focus on capacity bounds and scaling laws. The first thrust is on the capacity bounds of MIMO relay channels. First, a Gaussian MIMO relay channel model with fixed channe...
متن کاملOn the Robustness of Distributed Orthogonalization in Dense Wireless Networks
This paper examines capacity scaling in dense wireless fading networks, where L single-antenna source-destination terminal pairs communicate concurrently through a common set of K single-antenna relay terminals using two-hop half-duplex relaying. In the perfectly synchronized case, assuming perfect channel state information (CSI) at the relays (coherent network), the network capacity is known t...
متن کاملStrictly Positive and Continuous Random Fibonacci Sequences and Network Theory Applications
We motivate the study of a certain class of random Fibonacci sequences which we call continuous random Fibonacci sequences by demonstrating that their exponential growth rate can be used to establish capacity and power scaling laws for multihop cooperative amplify-and-forward (AF) relay networks. With these laws, we show that it is possible to construct multihop cooperative AF networks that sim...
متن کاملOn The Data Gathering Capacity of Large Scale Multihop Wireless Networks
In typical sensor network and mesh network scenarios, a subset of nodes (‘sources’) must send data to some designated set of destinations (“gateways”), while other nodes serve as relays. This some-to-some communication paradigm is distinct from the well-studied many-to-many, many-to-one, broadcast, and multicast paradigms, and is perhaps more prevalent than the other paradigms. We study the sca...
متن کاملUnderstanding the Capacity and Delay Scaling Laws of Delay Tolerant Networks: A Unified Approach
Mobile wireless networks with intermittent connectivity, often called Delay/Disruption Tolerant Networks (DTNs), have recently received a lot of attention because of their applicability in various applications. It has been shown that DTN routing and transport protocols can benefit from node mobility by letting the nodes carry and forward data to overcome partial connectivity. The scalability of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004